Visualization of Parallel Execution Graphs
نویسندگان
چکیده
Measuring and evaluating the runtime of parallel programs is a diicult task. In this paper we present tools for performance evaluation and visualization in the distributed thread system (DTS), a programming environment for portable parallel applications. We describe the visualization of a parallel trace log as an execution graph using a novel layout algorithm which has been tailored to expose the structure of multithreaded applications.
منابع مشابه
An Example of Deriving Performance Properties from a Visual Representation of Program Execution
This paper demonstrates that one can use a visual representation of the execution of a program to analyze performance properties. The method starts with a visualization of the progress of processes, and then applies geometric properties of the visualization to analyze program execution behavior. The visualization is based on progress graphs from the literature , which map the progress of each p...
متن کاملVPPB - A Visualization and Performance Prediction Tool for Multithreaded Solaris Programs
Efficient performance tuning of parallel programs is often hard. In this paper we describe an approach that uses a uni-processor execution of a multithreaded program as reference to simulate a multiprocessor execution. The speed-up is predicted, and the program behaviour is visualized as a graph, which can be used in the performance tuning process. The simulator considers scheduling as well as ...
متن کاملVisputer - A Graphical Visualization Tool for Parallel Programming
Designing parallel programs for message-passing systems is not an easy task. Difficulties arise largely due to human limitations in identifying relationships between simultaneously executed program components, or processes, and between the data computed by these processes. This paper presents a parallel program visualization tool, Visputer, that provides the ability to graphically design and ed...
متن کاملNear-Critical Path Analysis of Program Activity Graphs
Program activity graphs can be constructed from timestamped traces of appropriate execution events. Information about the activities on the k longest execution paths is useful in the analysis of parallel program performance. In this paper, four algorithms for finding the near–critical paths of program activity graphs are presented and compared, including an efficient new algorithm that utilizes...
متن کاملCompile-Time Views of Execution Structure Based on Ownership
A developer often needs to understand both the code structure and the execution structure of an object-oriented program. Class diagrams extracted from source are often sufficient to understand the code structure. However, existing static or dynamic analyses that produce raw graphs of objects and relations between them, do not convey design intent or readily scale to large programs. Imposing an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998